A group-embeddable non-automatic semigroup whose universal group is automatic

نویسنده

  • Alan J. Cain
چکیده

The concept of an automatic structure has been generalized from groups [ECH+] to semigroups [CRRT]. Several authors [CRR, Hof, Kam] have asked the following question: Let S be a finitely generated semigroup embeddable in a group and let G be its universal group [CP, Chapter ]. If G is automatic, must S be automatic? Examples in favour of this implication include: free groups and semigroups; braid groups and semigroups [ECH+, Chapter ]; abelian groups and their subsemigroups [CRR, Proposition .]. A similar question asked whether the automatism of a group implied the automatism of its positive subsemigroups. (A positive subsemigroup is a subsemigroup generated by a group generating set.) This question was recently answered negatively [CRR, Section ]. However, the techniques used cannot be adapted to answer the original question. The purpose of this paper is to answer the original question in the negative. Section  contains an example of a finitely generated semigroup S such that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presentations for Subsemigroups of Groups

This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary semigroup presentations, and Malcev presentaions. [A Malcev presentation is a presentation of a special type for a semigroup that can be embedded into a group. A group-embeddable semigroup is Malcev coherent if all of its finitely generated subsemigroups admit finite Malcev presentations.] The th...

متن کامل

Automatic structures for subsemigroups of Baumslag–Solitar semigroups

This paper studies automatic structures for subsemigroups of Baumslag–Solitar semigroups (that is, semigroups presented by ⟨x, y | (yx, xy)⟩ where m,n ∈ N). A geometric argument (a rarity in the field of automatic semigroups) is used to show that if m > n, all of the finitely generated subsemigroups of this semigroup are [right-] automatic. If m < n, all of its finitely generated subsemigroups ...

متن کامل

Every finite semigroup is embeddable in a finite relatively free semigroup

The title result is proved by a Murskii-type embedding. Results on some related questions are also obtained. For instance, it is shown that every finitely generated semigroup satisfying an identity ξ d = ξ2d is embeddable in a relatively free semigroup satisfying such an identity, generally with a larger d ; but that an uncountable semigroup may satisfy such an identity without being embeddable...

متن کامل

The universal $mathcal{AIR}$- compactification of a semigroup

In this paper we establish a characterization of abelian compact Hausdorff semigroups with unique idempotent and ideal retraction property. We also introduce a function algebra on a semitopological semigroup whose associated semigroup compactification is universal withrespect to these properties.

متن کامل

Embedding in Factorisable Restriction Monoids

Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which is embeddable in a semidirect product of a semilattice by a group.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011